Anti-matroids
نویسندگان
چکیده
We introduce an anti matroid as a family F of subsets of a ground set E for which there exists an assignment of weights to the elements of E such that the greedy algorithm to compute a maximal set with respect to inclusion in F of minimumweight nds instead the unique maximal set of maximumweight We introduce a special class of anti matroids I anti matroids and show that the Asymmetric and Sym metric TSP as well as the Assignment Problem are I anti matroids
منابع مشابه
Distance in Anti-Matroids
The concept of distance in matroids and geometric lattices is a familiar one. This paper examines the problem of deening a metric over anti-matroids and their corresponding lower semi-modular lattices and some ensuing consequences. One of the most intriguing results is that distance need not be \local" in an anti-matriod. The distance between two points may be aaected by changes that are far re...
متن کاملCATEGORICAL RELATIONS AMONG MATROIDS, FUZZY MATROIDS AND FUZZIFYING MATROIDS
The aim of this paper is to study the categorical relations betweenmatroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids.It is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. The category of matroids can be embedded in that offuzzifying matroids as a simul...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملM-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS
In this paper, the notion of closure operators of matroids is generalized to fuzzy setting which is called $M$-fuzzifying closure operators, and some properties of $M$-fuzzifying closure operators are discussed. The $M$-fuzzifying matroid induced by an $M$-fuzzifying closure operator can induce an $M$-fuzzifying closure operator. Finally, the characterizations of $M$-fuzzifying acyclic matroi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 30 شماره
صفحات -
تاریخ انتشار 2002